<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.9.1"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Aether.Physics2D: nkast.Aether.Physics2D.Common.Decomposition Namespace Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectlogo"><img alt="Logo" src="NugetLogo.png"/></td>
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">Aether.Physics2D
   &#160;<span id="projectnumber">2.0</span>
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.1 -->
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('namespacenkast_1_1_aether_1_1_physics2_d_1_1_common_1_1_decomposition.html',''); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
  <div class="summary">
<a href="#namespaces">Namespaces</a> &#124;
<a href="#nested-classes">Classes</a> &#124;
<a href="#enum-members">Enumerations</a>  </div>
  <div class="headertitle">
<div class="title">nkast.Aether.Physics2D.Common.Decomposition Namespace Reference</div>  </div>
</div><!--header-->
<div class="contents">
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:namespacenkast_1_1_aether_1_1_physics2_d_1_1_common_1_1_decomposition_1_1_c_d_t"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenkast_1_1_aether_1_1_physics2_d_1_1_common_1_1_decomposition_1_1_c_d_t.html">CDT</a></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
Classes</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><b>BayazitDecomposer</b></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Convex decomposition algorithm created by Mark Bayazit (<a href="http://mnbayazit.com/">http://mnbayazit.com/</a>) <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><b>CDTDecomposer</b></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">2D constrained Delaunay triangulation algorithm. Based on the paper "Sweep-line algorithm for constrained Delaunay triangulation" by V. Domiter and and B. Zalik <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><b>EarclipDecomposer</b></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Convex decomposition algorithm using ear clipping <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><b>FlipcodeDecomposer</b></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Convex decomposition algorithm created by unknown <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><b>SeidelDecomposer</b></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Convex decomposition algorithm created by Raimund <a class="el" href="namespacenkast_1_1_aether_1_1_physics2_d_1_1_common_1_1_decomposition_1_1_seidel.html">Seidel</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><b>Triangulate</b></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="enum-members"></a>
Enumerations</h2></td></tr>
<tr class="memitem:a9b9c7a0ca1ff1abfaf566ac8f88ea9f4"><td class="memItemLeft" align="right" valign="top">enum class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenkast_1_1_aether_1_1_physics2_d_1_1_common_1_1_decomposition.html#a9b9c7a0ca1ff1abfaf566ac8f88ea9f4">TriangulationAlgorithm</a> { <br />
&#160;&#160;<a class="el" href="namespacenkast_1_1_aether_1_1_physics2_d_1_1_common_1_1_decomposition.html#a9b9c7a0ca1ff1abfaf566ac8f88ea9f4a67ac673518d5cac732e925c3621006fd">Earclip</a>
, <a class="el" href="namespacenkast_1_1_aether_1_1_physics2_d_1_1_common_1_1_decomposition.html#a9b9c7a0ca1ff1abfaf566ac8f88ea9f4a666e685ea058b7188395cd99aa1b8a19">Bayazit</a>
, <a class="el" href="namespacenkast_1_1_aether_1_1_physics2_d_1_1_common_1_1_decomposition.html#a9b9c7a0ca1ff1abfaf566ac8f88ea9f4a0efdbf579d7141aad03cab430e30307c">Flipcode</a>
, <a class="el" href="namespacenkast_1_1_aether_1_1_physics2_d_1_1_common_1_1_decomposition.html#a9b9c7a0ca1ff1abfaf566ac8f88ea9f4aab178da569507fcd537f712af786ca97">Seidel</a>
, <br />
&#160;&#160;<b>SeidelTrapezoids</b>
, <a class="el" href="namespacenkast_1_1_aether_1_1_physics2_d_1_1_common_1_1_decomposition.html#a9b9c7a0ca1ff1abfaf566ac8f88ea9f4a6601e04d7cfa7c4f369d32e14b0ff0e2">Delauny</a>
<br />
 }</td></tr>
<tr class="separator:a9b9c7a0ca1ff1abfaf566ac8f88ea9f4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<h2 class="groupheader">Enumeration Type Documentation</h2>
<a id="a9b9c7a0ca1ff1abfaf566ac8f88ea9f4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9b9c7a0ca1ff1abfaf566ac8f88ea9f4">&#9670;&nbsp;</a></span>TriangulationAlgorithm</h2>

<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">enum <a class="el" href="namespacenkast_1_1_aether_1_1_physics2_d_1_1_common_1_1_decomposition.html#a9b9c7a0ca1ff1abfaf566ac8f88ea9f4">TriangulationAlgorithm</a></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">strong</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<table class="fieldtable">
<tr><th colspan="2">Enumerator</th></tr><tr><td class="fieldname"><a id="a9b9c7a0ca1ff1abfaf566ac8f88ea9f4a67ac673518d5cac732e925c3621006fd"></a>Earclip&#160;</td><td class="fielddoc"><p>Convex decomposition algorithm using ear clipping </p>
<p>Properties:</p><ul>
<li>Only works on simple polygons.</li>
<li>Does not support holes.</li>
<li>Running time is O(n^2), n = number of vertices.</li>
</ul>
</td></tr>
<tr><td class="fieldname"><a id="a9b9c7a0ca1ff1abfaf566ac8f88ea9f4a666e685ea058b7188395cd99aa1b8a19"></a>Bayazit&#160;</td><td class="fielddoc"><p>Convex decomposition algorithm created by Mark Bayazit (<a href="http://mnbayazit.com/">http://mnbayazit.com/</a>) </p>
<p>Properties:</p><ul>
<li>Tries to decompose using polygons instead of triangles.</li>
<li>Tends to produce optimal results with low processing time.</li>
<li>Running time is O(nr), n = number of vertices, r = reflex vertices.</li>
<li>Does not support holes.</li>
</ul>
</td></tr>
<tr><td class="fieldname"><a id="a9b9c7a0ca1ff1abfaf566ac8f88ea9f4a0efdbf579d7141aad03cab430e30307c"></a>Flipcode&#160;</td><td class="fielddoc"><p>Convex decomposition algorithm created by unknown </p>
<p>Properties:</p><ul>
<li>No support for holes</li>
<li>Very fast</li>
<li>Only works on simple polygons</li>
<li>Only works on counter clockwise polygons</li>
</ul>
</td></tr>
<tr><td class="fieldname"><a id="a9b9c7a0ca1ff1abfaf566ac8f88ea9f4aab178da569507fcd537f712af786ca97"></a>Seidel&#160;</td><td class="fielddoc"><p>Convex decomposition algorithm created by Raimund <a class="el" href="namespacenkast_1_1_aether_1_1_physics2_d_1_1_common_1_1_decomposition_1_1_seidel.html">Seidel</a> </p>
<p>Properties:</p><ul>
<li>Decompose the polygon into trapezoids, then triangulate.</li>
<li>To use the trapezoid data, use ConvexPartitionTrapezoid()</li>
<li>Generate a lot of garbage due to incapsulation of the Poly2Tri library.</li>
<li>Running time is O(n log n), n = number of vertices.</li>
<li>Running time is almost linear for most simple polygons.</li>
<li>Does not care about winding order.</li>
</ul>
</td></tr>
<tr><td class="fieldname"><a id="a9b9c7a0ca1ff1abfaf566ac8f88ea9f4a6601e04d7cfa7c4f369d32e14b0ff0e2"></a>Delauny&#160;</td><td class="fielddoc"><p>2D constrained Delaunay triangulation algorithm. Based on the paper "Sweep-line algorithm for constrained Delaunay triangulation" by V. Domiter and and B. Zalik </p>
<p>Properties:</p><ul>
<li>Creates triangles with a large interior angle.</li>
<li>Supports holes</li>
<li>Generate a lot of garbage due to incapsulation of the Poly2Tri library.</li>
<li>Running time is O(n^2), n = number of vertices.</li>
<li>Does not care about winding order.</li>
</ul>
</td></tr>
</table>

</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="namespacenkast.html">nkast</a></li><li class="navelem"><a class="el" href="namespacenkast_1_1_aether.html">Aether</a></li><li class="navelem"><a class="el" href="namespacenkast_1_1_aether_1_1_physics2_d.html">Physics2D</a></li><li class="navelem"><a class="el" href="namespacenkast_1_1_aether_1_1_physics2_d_1_1_common.html">Common</a></li><li class="navelem"><a class="el" href="namespacenkast_1_1_aether_1_1_physics2_d_1_1_common_1_1_decomposition.html">Decomposition</a></li>
    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.1 </li>
  </ul>
</div>
</body>
</html>
